Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
نویسندگان
چکیده
منابع مشابه
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
Extensive research has been devoted to preemptive scheduling. However, little attention has been paid to problems where a certain time penalty must be incurred if preemption is allowed. In this paper, we consider the single-machine scheduling problem of minimizing the total completion time subject to job release dates and preemption penalties, where each time a job is started, whether initially...
متن کاملMinimizing average completion time in the presence of release dates
A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0,...
متن کاملMinimizing Makespan and Total Completion Time Criteria on a Single Machine with Release Dates
1 Department of Computer Science University for Development Studies, Ghana 2 Department of Industrial and Production Engineering University of Ibadan, Nigeria Corresponding Author: E. O. Oyetunji _________________________________________________________________________________________________ Abstract This paper considers the scheduling problem of simultaneously minimizing the makespan and tota...
متن کاملMinimizing Total Completion Time for Preemptive Scheduling with Release Dates and Deadline Constraints
It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NPhard. Du and Leung solved some special cases by the generalized Baker’s algorithm and the generalized Smith’s algorithm in O(n) time. In this paper we give an O(n) algorithm for the special case where the processing times and deadlines are agreeab...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2004
ISSN: 1094-6136
DOI: 10.1023/b:josh.0000031424.35504.c4